Tight Lower Bound for the Channel Assignment Problem
نویسندگان
چکیده
منابع مشابه
A Tight Lower Bound for the Adjacent Quadratic Assignment Problem
In this paper we address the Adjacent Quadratic Assignment Problem (AQAP) which is a variant of the QAP where the cost coefficient matrix has a particular structure. Motivated by strong lower bounds obtained by applying Reformulation Linearization Technique (RLT) to the classical QAP, we propose two special RLT representations for the problem. The first is based on a “flow” formulation whose li...
متن کاملTight Lower Bound for the Partial-Sums Problem
This is perhaps one of the most fundamental data structure problems. When the values of A[1, . . . , n] are drawn from a semigroup, its static version (where updates are not allowed) has the famous inverse-Ackermann Θ(α(n)) query bound with linear storage [4]; the dynamic version can be easily solved by a binary tree in O(log n) time per operation, and a corresponding Ω(log n) lower bound was p...
متن کاملLower Bounds from Tile Covers for the Channel Assignment Problem
A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a problem of covering the demand in a cellular network by pre-assigned blocks of cells, called tiles. This tile cover approach is applied to networks with a cosite constraint and two different constraints between cells. New bounds are derived u...
متن کاملA Tight Bound for the Lamplighter Problem
We settle an open problem, raised by Y. Peres and D. Revelle, concerning the L mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation distance of the chain, and show that the lamplighter graphs once again provide examples of tightness of our results.
متن کاملA Tight Lower Bound for Processor Coordination
We prove a tight lower bound on the running time of oblivious solutions to k set agreement In k set agreement processors start with input values from a given set and choose output values from the same set In every execution the set of output values must be contained in the set of input values and the set of output values must have size at most k A solution is oblivious if it does not make use o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2876505